The Semantics of Graph Programs
نویسندگان
چکیده
GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handling low-level data structures. The core of GP consists of four constructs: single-step application of a set of conditional graphtransformation rules, sequential composition, branching and iteration. We present a formal semantics for GP in the style of structural operational semantics. A special feature of our semantics is the use of finitely failing programs to define GP’s powerful branching and iteration commands.
منابع مشابه
Semantical Equivalence of the Control Flow Graph and the Program Dependence Graph
The program dependence graph (PDG) represents data and control dependence between statements in a program. This paper presents an operational semantics of program dependence graphs. Since PDGs exclude artificial order of statements that resides in sequential programs, executions of PDGs are not unique. However, we identified a class of PDGs that have unique final states of executions, called de...
متن کاملGraph representations of logic programs: properties and comparison
In this paper, we propose a formalization of the features that a graph representation of logic programs under the answer set semantics should in our opinion exhibit in order to be a satisfactory and useful representation formalism. We introduce a concept of isomorphism between a program and the corresponding graph. We show the importance of isomorphism for program analysis and we compare differ...
متن کاملGraph Theoretical Structures in Logic Programs and Default Theories
In this paper we present a graph representation of logic programs and default theories. We show that many of the semantics proposed for logic programs can be expressed in terms of notions emerging from graph theory, establishing in this way a link between the fields. Namely the stable models, the partial stable models, and the well-founded semantics correspond respectively to the kernels, semik...
متن کاملFrom Trees to Graphs: De£ning the Semantics of Diagram Languages with Graph Transformation
In order to de£ne the semantics of diagram languages, new techniques may be developed following the established approaches of denotational, operational, or algebraic semantics of programming languages. Due to the multi-dimensional nature of diagrams (as opposed to the linear structure of programs), these new approaches should be based on graphs (rather than trees or terms) and graph transformat...
متن کاملMixed Lazy/Strict Graph Semantics
Explicitly enforcing strictness is often used by functional programmers as an important tool for making applications fit time and space efficiency requirements. Few functional programmers however, are familiar with the consequences of explicitly enforcing strictness for formal reasoning about their programs. Some “folklore” knowledge has emerged but this is based on experience rather than on ri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009